Efficient Routing and Broadcasting Algorithms in de Bruijn Networks
نویسندگان
چکیده
Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent. Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algorithms can only work in dBG(2,k). In this paper, we investigate shortest path routing algorithms in the condition of existing failure, based on the Bidirectional de Bruijn graph (BdBG). And we also investigate broadcasting in BdBG for a degree greater than or equal to two.
منابع مشابه
An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملWormhole routing in de Bruijn networks and hyper-de Bruijn networks
The order-(m, n) hyper-deBruijn graph HD(m,n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally important subgraphs and admit efficient implementat...
متن کاملWormhole Routing in De Bruijn Networks and Hyper-debruijn
The order-(m,n) hyper-deBruijn graph H D ( m , n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally imponant subgraphs and admit efficient implemen...
متن کاملBroadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks
We use simple compound properties of de Bruijn related networks to get new bounds about broadcasting and gossiping on such networks. We get some asymptotically optimal results on undi-rected de Bruijn, Kautz, and generalization of the shuue-exchange networks. Our techniques allow more generally to derive eecient broadcasting protocols for the undirected graph associated to a line digraph. As ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004